Total decomposition and block numerical range
نویسندگان
چکیده
منابع مشابه
Some results on the block numerical range
The main results of this paper are generalizations of classical results from the numerical range to the block numerical range. A different and simpler proof for the Perron-Frobenius theory on the block numerical range of an irreducible nonnegative matrix is given. In addition, the Wielandt's lemma and the Ky Fan's theorem on the block numerical range are extended.
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Numerical Algorithm for Block-diagonal Decomposition of Matrix ∗-algebras
Motivated by recent interest in group-symmetry in the area of semidefinite programming, we propose a numerical method for finding a finest simultaneous block-diagonalization of a finite number of symmetric matrices, or equivalently the irreducible decomposition of the matrix ∗-algebra generated by symmetric matrices. The method does not require any algebraic structure to be known in advance, wh...
متن کاملThe Block Numerical Range of Analytic Operator Functions
We introduce the block numerical range Wn(L ) of an operator function L with respect to a decomposition H = H1⊕ . . .⊕Hn of the underlying Hilbert space. Our main results include the spectral inclusion property and estimates of the norm of the resolvent for analytic L . They generalise, and improve, the corresponding results for the numerical range (which is the case n = 1) since the block nume...
متن کاملA Numerical Algorithm for Block-diagonal Decomposition of Matrix * -algebras B-445 a Numerical Algorithm for Block-diagonal Decomposition of Matrix * -algebras
Motivated by recent interest in group-symmetry in the area of semidefinite programming, we propose a numerical method for finding a finest simultaneous block-diagonalization of a finite number of symmetric matrices, or equivalently the irreducible decomposition of the matrix ∗-algebra generated by symmetric matrices. The method does not require any algebraic structure to be known in advance, wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Journal of Mathematical Analysis
سال: 2011
ISSN: 1735-8787
DOI: 10.15352/bjma/1313362979